﻿#define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string.h>
#include <math.h>
#include <unordered_map>
using namespace std;

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        sort(g.begin(), g.end());
        sort(s.begin(), s.end());
        int gsize = g.size();
        int ssize = s.size();
        int ret = 0;
        int i = 0, j = 0;
        while (i < gsize && j < ssize)
        {
            if (s[j] >= g[i]) {
                j++;
                i++;
                ret++;
            }
            else j++;
        }
        return ret;
    }
};

int main()
{
    vector<int> arr(10, 0);
    return 0;
}
